On the Two-Equal-Disjoint Path Cover Problem of Crossed Cubes
نویسندگان
چکیده
Embedding of paths have attracted much attention in the parallel processing. Many-to-many communication is one of the most central issues in various interconnection networks. A graph G is globally two-equal-disjoint path coverable if for any two distinct pairs of vertices (u, v) and (w, x) of G, there exist two disjoint paths P and Q satisfied that (1) P joins u to v and Q joins w to x, (2) |P | = |Q|, and (3) V (P ∪ Q) = V (G). In this paper, we prove that CQn is globally 2-equal-disjoint path coverable for n ≥ 5.
منابع مشابه
On the Two-Equal-Disjoint Path Cover Problem of Twisted Cubes
Embedding of paths have attracted much attention in the parallel processing. Many-to-many communication is one of the most central issues in various interconnection networks. A graph G is globally two-equal-disjoint path coverable if for any two distinct pairs of vertices (u, v) and (x, y) of G, there exist two disjoint paths Puv and Pxy satisfied that (1) Puv joins u to v and Pxy joins x to y,...
متن کاملConstructing Two Edge-Disjoint Hamiltonian Cycles and Two-Equal Path Cover in Augmented Cubes
The n-dimensional hypercube network Qn is one of the most popular interconnection networks since it has simple structure and is easy to implement. The n-dimensional augmented cube AQn, an important variation of the hypercube, possesses several embedding properties that hypercubes and other variations do not possess. The advantages of AQn are that the diameter is only about half of the diameter ...
متن کاملA linear-time algorithm for finding a paired 2-disjoint path cover in the cube of a connected graph
For a connected graph G = (V (G), E(G)) and two disjoint subsets of V (G) A = {α1, . . . , αk} and B = {β1, . . . , βk}, a paired (many-to-many) k-disjoint path cover of G joining A and B is a vertex-disjoint path cover {P1, . . . , Pk} such that Pi is a path from αi to βi for 1 ≤ i ≤ k. In the recent paper [Disjoint Path Covers in Cubes of Connected Graphs, Discrete Mathematics 325 (2014) 65–7...
متن کاملDisjoint path covers in cubes of connected graphs
Given a graph G, and two vertex sets S and T of size k each, a many-tomany k-disjoint path cover of G joining S and T is a collection of k disjoint paths between S and T that cover every vertex of G. It is classified as paired if each vertex of S must be joined to a designated vertex of T , or unpaired if there is no such constraint. In this article, we first present a necessary and sufficient ...
متن کاملMany-to-many two-disjoint path covers in cylindrical and toroidal grids
A many-to-many k-disjoint path cover of a graph joining two disjoint vertex sets S and T of equal size k is a set of k vertex-disjoint paths between S and T that altogether cover every vertex of the graph. The many-to-many k-disjoint path cover is classified as paired if each source in S is further required to be paired with a specific sink in T , or unpaired otherwise. In this paper, we first ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006